package com.mryang.ladder;

import java.util.Scanner;

/**
 * @ClassName L1_009
 * @Description TODO N个分数求和（输出也以 整数、分数 形式输出）
 * @Author Genius
 * @Date 2021/1/20 19:19
 */
public class L1_009 {
    public static void main(String[] args) {
        Scanner scr = new Scanner(System.in);
        int number = scr.nextInt();
        long[] num = new long[number];
        for (int i = 0; i < number; i++) {
            num[i] = scr.nextLong();
        }
        while(number>0){

        }

    }
    // 求最大公因数递归算法
    public int gcd(int x, int y)
    {	if (y!=0)
        return gcd(y, x%y);
    else
        return x;
    }
}
